Bilipschitz embeddings of metric spaces into Euclidean spaces

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Bilipschitz Embeddings of Metric Spaces into Euclidean Spaces

When does a metric space admit a bilipschitz embedding into some finite-dimensional Euclidean space? There does not seem to be a simple answer to this question. Results of Assouad [A1], [A2], [A3] do provide a simple answer if one permits some small (“snowflake”) deformations of the metric, but unfortunately these deformations immediately disrupt some basic aspects of geometry and analysis, lik...

متن کامل

Embeddings of Proper Metric Spaces into Banach Spaces

We show that there exists a strong uniform embedding from any proper metric space into any Banach space without cotype. Then we prove a result concerning the Lipschitz embedding of locally finite subsets of Lp-spaces. We use this locally finite result to construct a coarse bi-Lipschitz embedding for proper subsets of any Lp-space into any Banach space X containing the l n p ’s. Finally using an...

متن کامل

Coarse Embeddings of Metric Spaces into Banach Spaces

There are several characterizations of coarse embeddability of a discrete metric space into a Hilbert space. In this note we give such characterizations for general metric spaces. By applying these results to the spaces Lp(μ), we get their coarse embeddability into a Hilbert space for 0 < p < 2. This together with a theorem by Banach and Mazur yields that coarse embeddability into l2 and into L...

متن کامل

Embeddings of Locally Finite Metric Spaces into Banach Spaces

We show that if X is a Banach space without cotype, then every locally finite metric space embeds metrically into X.

متن کامل

Optimal distortion embeddings of distance regular graphs into Euclidean spaces

In this paper we give a lower bound for the least distortion embedding of a distance regular graph into Euclidean space. We use the lower bound for finding the least distortion for Hamming graphs, Johnson graphs, and all strongly regular graphs. Our technique involves semidefinite programming and exploiting the algebra structure of the optimization problem so that the question of finding a lowe...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Publicacions Matemàtiques

سال: 1999

ISSN: 0214-1493

DOI: 10.5565/publmat_43299_06